Cyclic Hamiltonian cycle systems of the complete graph
نویسندگان
چکیده
We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but k = 15 and p with p prime and ¿ 1. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k; m) of odd integers with k as above but (k; m) = (3; 3). c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn − I, exist if and only if n ≡ 2, 4( mod 8) and n 6= 2p with p prime and α ≥ 1.
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملDirected cyclic Hamiltonian cycle systems of the complete symmetric digraph
In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete symmetric digraph, K∗ n, exist if and only if n ≡ 2 (mod 4) and n 6= 2p with p prime and α ≥ 1. We also show that directed cyclic hamiltonian cycle systems of the complete symmetric digraph minus a set of n/2 vertex-independent digons, (Kn− I)∗, exist if and only if n ≡ 0 (mod 4).
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملA collection of results on Hamiltonian cycle systems with a nice automorphism group
We collect some old and new results on Hamiltonian cycle systems of the complete graph (or the complete graph minus a 1-factor) having an automorphism group that satisfies specific properties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 279 شماره
صفحات -
تاریخ انتشار 2004